Generalizing Transduction Grammars to Model Continuous Valued Musical Events
نویسنده
چکیده
We describe a generalization of stochastic transduction grammars to be able to model continuous values, the first models to natively handle continuous-valued musical events such as microtones while still gaining the advantages of STGs for describing complex structural, hierarchically compositional inter-part relationships. Music transduction modeling based on linguistic or grammatical models have commonly approximated continuous valued features like pitch by quantizing them into discrete symbols, which represent ‘clean’ notes on a scale. The sacrifice is worthwhile for modeling the learning of musical improvisation and accompaniment where musical sequences interact hierarchically at many overlapping levels of granularity; previous work has shown in flamenco and hip hop how discrete STGs allow each part to influence decisions made by other parts while also satisfying contextual preferences across multiple dimensions. We extend the modeling machinery toward the many musical genres where contextual relationships between continuous values influence improvisational and accompaniment decisions. Illustrating using the ‘bent notes’ prevalent in blues, we show how continuous STGs can be generalized from conventional discrete STGs which have until now only been able to handle symbolic events, thereby allowing musical signals to remain finely represented as continuous values without crude quantization into discrete symbols, while still retaining the ability to model probabilistic structural relations between multiple musical languages. We exemplify this new approach in learning blues notes biases via a new polynomial time algorithm for expectation-maximization training of continuous SITGs (stochastic inversion transduction grammars), a specific subclass of STGs that has already proven useful in numerous applications in both music and language. 1. STOCHASTIC TRANSDUCTION GRAMMARS To introduce continuous STGs (see Wu [4, 5] for details of conventional STGs) we will generalize a step at a time from context-free grammars, illustrating with the well-known c ⃝ Dekai Wu. Licensed under a Creative Commons Attribution 4.0 International License (CC BY 4.0). Attribution: Dekai Wu. “Generalizing Transduction Grammars to Model Continuous Valued Musical Events”, Extended abstracts for the Late-Breaking Demo Session of the 17th International Society for Music Information Retrieval Conference, 2016. twelve-bar blues form in which verses consist of three lines: a first four bars, a second four, and a third four called a turnaround. A stochastic context-free grammar could use these syntactic rules to describe twelve-bar blues with the first four in both basic [AA AA] and ‘quick to four’ [AD AA] variants, biased by rule probabilities:
منابع مشابه
How Blue Can You Get? Learning Structural Relationships for Microtones via Continuous Stochastic Transduction Grammars
We describe a new approach to probabilistic modeling of structural inter-part relationships between continuous-valued musical events such as microtones, through a novel class of continuous stochastic transduction grammars. Linguistic and grammar oriented models for music commonly approximate features like pitch using discrete symbols to represent ‘clean’ notes on scales. In many musical genres,...
متن کاملAlternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کاملUniform connectedness and uniform local connectedness for lattice-valued uniform convergence spaces
We apply Preuss' concept of $mbbe$-connectedness to the categories of lattice-valued uniform convergence spaces and of lattice-valued uniform spaces. A space is uniformly $mbbe$-connected if the only uniformly continuous mappings from the space to a space in the class $mbbe$ are the constant mappings. We develop the basic theory for $mbbe$-connected sets, including the product theorem. Furtherm...
متن کاملPattern Grammars in Formal Representations of Musical Structures
This paper introduces several formal models of pattern representation in music. Polyvalent multimodal grammars describe partially overlapping sound events as found in polyphonic structures. Bol Processor grammars are characterizations of sequential events in terms of substring repetitions, homomorphisms, etc. Parsing techniques, stochastic production and recent developments of BP grammars are b...
متن کاملLearning Musical Creativity via Stochastic Transduction Grammars: Combination, Exploration and Transformation
We discuss how Boden’s creative processes of combination, exploration, and transformation naturally emerge in models that learn musical improvisation via stochastic transduction grammar induction. Unlike a conventional monolingual grammar, a transduction grammar represents complex transformative relationships between one representation language and another. For musical improvisation, a transduc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016